翻訳と辞書 Words near each other ・ Writers' Federation of Nova Scotia ・ Writers' Forum ・ Writers' Guild of Great Britain ・ Writers' Guild of Norway ・ WRITERS' Journal ・ Writers' League of Texas ・ Writers' Museum ・ Writers' Trust Engel/Findley Award ・ Writers' Trust of Canada ・ Writers' Union of Canada ・ Writers' Union of Kazakhstan ・ Writers' Union of Romania ・ Writers' War Board ・ WritersCorps ・ Write–read conflict ・ Write–write conflict ・ Writhe ・ Writhed hornbill ・ Writhlington ・ Writhlington School ・ Writhlington SSSI ・ Writing ・ Writing about Writing ・ Writing Across the Curriculum ・ Writing and Difference ・ Writing armchair ・ Writing assessment ・ Writing Black Britain ・ Writing center ・ Writing center assessment Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Write–write conflict ： ウィキペディア英語版 Write–write conflict In computer science, in the field of databases, Write-Write Conflict, also known as overwriting uncommitted data is a computational anomaly associated with interleaved execution of transactions. Given a schedule S $S\; =\; \backslash begin$ T1 & T2 \\ W(A) & \\ & W(B) \\ W(B) & \\ Com. & \\ & W(A)\\ & Com. \end note that there is no read in this schedule. The writes are called ''blind writes''. We have a ''lost update''. Any attempts to make this schedule serial would give off two different results (either T1's version of A and B is shown, or T2's version of A and B is shown), and would not be the same as the above schedule. This schedule would not be serializable. Strict 2PL overcomes this inconsistency by locking T1 out from B. Unfortunately, deadlocks are something Strict 2PL does not overcome all the time. == See also == * Concurrency control * Read-Write conflict * Write-Read conflict 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Write–write conflict」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.